منابع مشابه
Submodular partition functions
Adapting the method introduced in Graph Minors X, we propose a new proof of the duality between the bramble-number of a graph and its tree-width. Our approach is Preprint submitted to Elsevier 23 December 2008 based on a new definition of submodularity on partition functions which naturally extends the usual one on set functions. The proof does not rely on Menger’s theorem, and thus greatly gen...
متن کاملComputability of Width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether a graph has treewidth, branch-width, etc. at most k. Contrary to these results, we show that there is no sub-exponential algorithm for determining whether the width of a given submodular partition function is at most tw...
متن کاملSVOČ 2009 Computability of Branch-width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether a graph has tree-width, branch-width, etc. at most k. Contrary to these results, we show that there is no sub-exponential algorithm for determining whether the width of a given submodular partition function is at most t...
متن کاملA Proportionally Submodular Functions
Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions, which we call proportionally submodular functions. Our extension includes some (mildly) supermodular functions. We show that several natural functions belong to ...
متن کاملApproximating submodular functions everywhere
Submodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle. Many interesting problems involving submodular functions can be solved using only polynomially many queries to the oracle, e.g., exact minimization or approximate maximization. In this paper, we consider the problem of approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.04.033